Orthogonality Matrices for Modulesover Finite Frobenius RingsandMacWilliams’ EquivalenceTheorem
نویسندگان
چکیده
MacWilliams’ equivalence theorem states that Hamming isometries between linear codes extend to monomial transformations of the ambient space. One of the most elegant proofs for this result is due to K. P. Bogart et al. (1978, Inform. and Control 37, 19–22) where the invertibility of orthogonality matrices of finite vector spaces is the key step. The present paper revisits this technique in order to make it work in the context of linear codes over finite Frobenius rings. # 2002 Elsevier Science (USA)
منابع مشابه
PERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کاملA new direct updating method for undamped structural systems
A new numerical method for simultaneously updating mass and stiffness matrices based on incomplete modal measured data is presented. By using the Kronecker product, all the variables that are to be modified can be found out and then can be updated directly. The optimal approximation mass matrix and stiffness matrix which satisfy the required eigenvalue equation and orthogonality condition are f...
متن کاملMatrix product codes over finite commutative Frobenius rings
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.
متن کاملFrobenius kernel and Wedderburn's little theorem
We give a new proof of the well known Wedderburn's little theorem (1905) that a finite division ring is commutative. We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group theory to build a proof.
متن کاملOn Plotkin-Optimal Codes over Finite Frobenius Rings
We study the Plotkin bound for codes over a finite Frobenius ring R equipped with the homogeneous weight. We show that for codes meeting the Plotkin bound, the distribution on R induced by projection onto a coordinate has an interesting property. We present several constructions of codes meeting the Plotkin bound and of Plotkin-optimal codes. We also investigate the relationship between Butson-...
متن کامل